Enumeration Of Labelled Graphs
نویسندگان
چکیده
منابع مشابه
Asymptotic Enumeration of Labelled Graphs by Genus
We obtain asymptotic formulas for the number of rooted 2-connected and 3connected surface maps on an orientable surface of genus g with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled k-connected graphs of orientable g...
متن کاملEnumeration of Some Labelled Trees
In this paper we are interesting in the enumeration of rooted labelled trees according to the relationship between the root and its sons. Let Tn;k be the family of Cayley trees on n] such that the root has exactly k smaller sons. In a rst time we give a bijective proof of the fact that jTn+1;kj = ? n k n n?k. Moreover, we use the family Tn+1;0 of Cayley trees for which the root is smaller than ...
متن کامل- Algebras of Labelled Graphs
We describe a class of C *-algebras which simultaneously generalise the ul-tragraph algebras of Tomforde and the shift space C *-algebras of Matsumoto. In doing so we shed some new light on the different C *-algebras that may be associated to a shift space. Finally, we show how to associate a simple C *-algebra to an irreducible sofic shift.
متن کاملThe structure and labelled enumeration of K_{3,3}-subdivision-free projective-planar graphs
We consider the class F of 2-connected non-planar K3,3-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K5 (the core) where the edges are replaced by two-pole networks constructed from 2-connected planar graphs. A method to enumerate these graphs in the labelled case is described. Moreover, we enumerate the ho...
متن کاملEvacuation of labelled graphs
In this note, we extend Schiitzenberger’s evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged. Let G = ( V, E) be a simple undirected graph without loops; V is its set of vertices, and E its se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 1956
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-1956-046-2